Nonincrease almost everywhere of certain measurable functions with applications to stochastic processes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applications of convolution and‎ ‎subordination to certain $p$-valent functions

In this paper we considered some new classes of multivalent functions by using Aouf-Silverman-Srivastava operator and derived some important results using convolution and subordination technique. This new class is an extension of a class which introduced before.

متن کامل

Nonincrease Everywhere of the Brownian Motion Process

The (linear, separable) Brownian motion process has been studied more than any other stochastic process. It has many applications and, at least since Bachelier, probabilists have been at(tract,ed by its delicate and curious properties. It furnished, in the hands of N. Jyiener, the first instance of a satisfactorily defined nondiscrete stochastic process n-ith continuous time parameter, and it i...

متن کامل

On Measurable Stochastic Processes

In recent years probability theory has been formulated mathematically as measure theory; in the case of stochastic processes depending upon a continuous parameter the measures considered are defined on certain subspaces of the space of all functions of a real variable.! This formulation of stochastic processes depending upon a continuous parameter gives rise to certain measurability problems, a...

متن کامل

Incentive Compatibility: Everywhere vs. Almost Everywhere∗

A risk neutral buyer observes a private signal s ∈ [a, b], which informs her that the mean and variance of a normally distributed risky asset are s and σ s respectively. She then sets a price at which to acquire the asset owned by risk averse “outsiders”. Assume σ s ∈ { 0, σ } for some σ > 0 and let B = { s ∈ [a, b] | σ s = 0 } . If B = ∅, then there exists a fully revealing equilibrium in whic...

متن کامل

Almost-Everywhere Secure Computation

Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network has very large connectivity — in fact, , where is the number of potential corruptions in the network. This impossibility result renders existing MPC results far less applicable in practice, since many deployed network...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1983

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1983-0691295-8